Efficiently Evaluating U-Resultants
نویسنده
چکیده
The objective is to efficiently evaluate u-resultants for numerical uvalues (such as over a finite field). The u-resultant of n homogeneous polynomials in n + 1 variables is defined to be the multi-variable resultant of these n polynomials and a general linear form in the same variables whose coefficients are represented by the symbols u0, . . . , un. It is shown that the u-resultant can be extracted from a matrix that is smaller than the standard Macaulay matrix obtained from the definition of the u-resultant. The ratio of the sizes of the standard Macaulay matrix and of the matrix introduced by the current paper approximately equals the average of the total degrees of the homogeneous polynomials. As expected, experimental timings show a substantial speed-up when using the smaller matrix. ∗Supported by the NSF grant CCF 0430741
منابع مشابه
Sparse Resultants via Multiprojective Elimination Theory
We propose an alternative definition of sparse resultants as resultants of multiprojective cycles in a suitable toric variety. This definition differs from the classical one in the sense that in our case, sparse resultants are polynomials defining cycles and not (irreducible) hypersurfaces. This approach allows us to deduce straightforwardly several basic properties of sparse resultants via mul...
متن کاملIn-place Arithmetic for Polinominals over Zn
We present space and time efficient algorithms for univariate polynomial arithmetic operations over Z mod n where the modulus n does not necessarily fit into is not a machine word. These algorithms provide the key tools for the efficient implementation of polynomial resultant gcd and factorization computation over Z, without having to write large amounts of code in a systems implementation lang...
متن کاملDeterminants of Modular Macaulay Matrices
Introduction: Resultants of multi-variate polynomials are fundamental for solving systems of polynomial equations and have numerous applications. Thus they are being intensely studied. Macaulay [3] showed that the projective resultant of a list of multi-variate polynomials is the quotient of two determinants. The numerator of this quotient is the determinant of a (sparse) matrix containing the ...
متن کاملSupplemental Material For " A Shape - Aware Model for Discrete Texture Synthesis "
λ((u,s);x)= f (x) f (x\(u,s)) if (u,s) is one of the elements of x, f (x∪(u,s)) f (x) otherwise. (A) Evaluating this conditional intensity λ efficiently is thus a critical requirement. One should stress that the ratios f (x\(u,s)) f (x) and f (x∪(u,s)) f (x) are of course not computed directly but after simplification of the many common terms that are on both sides of the fractions. More exp...
متن کاملar X iv : m at h / 04 01 22 0 v 3 [ m at h . A C ] 2 8 A pr 2 00 5 CYCLIC RESULTANTS
We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial f of degree d, there are exactly 2 distinct degree d polynomials with the same set of cyclic resultants as f . However, in the generic monic case, degree d polynomials are uniquely determined by their cyclic resultants. Moreover, two reciprocal (“palindromic”) polynomials giving rise to t...
متن کامل